A Henkin-Style Proof of Completeness for First-order Algebraizable Logics

نویسندگان

  • Petr Cintula
  • Carles Noguera
چکیده

This paper considers Henkin’s proof of completeness of classical first-order logic and extends its scope to the realm of algebraizable logics in the sense of Blok and Pigozzi. Given a propositional logic L (for which we only need to assume that it has an algebraic semantics L and a suitable disjunction) we axiomatize two natural firstorder extensions L∀ and L∀ and prove that the former is complete with respect to all models over algebras from L, while the latter is complete with respect to all models over relatively finitely subdirectly irreducible algebras. While the first completeness result is relatively straightforward, the second requires non-trivial modifications of Henkin’s proof by making use of the disjunction connective. As a byproduct, we also obtain a form of Skolemization provided that the algebraic semantics admits regular completions. The relatively modest assumptions on the propositional side allow for a wide generalization of previous approaches by Rasiowa, Sikorski, Hájek, Horn, and others and help to illuminate the ‘essentially first-order’ steps in the classical Henkin’s proof. §

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kripke completeness revisited

The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for...

متن کامل

The Countable Henkin Principle

This is a revised and extended version of an article which encapsulates a key aspect of the “Henkin method” in a general result about the existence of finitely consistent theories satisfying prescribed closure conditions. This principle can be used to give streamlined proofs of completeness for logical systems, in which inductive Henkin-style constructions are replaced by a demonstration that a...

متن کامل

Fibring Modal First-Order Logics: Completeness Preservation

Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of such logics, using a variation of the Henkin method that takes advantage of the presence of equality and inequality in the logic. As a corollary, completeness is shown to be preserved when fibring logics in that class...

متن کامل

Henkin on Completeness

The Completeness of Formal Systems is the title of the thesis that Henkin presented at Princenton in 1947, under the guiadance of Alonzo Church. His renowned results on completeness for both type theory and first order logic are part of his thesis. It is interesting to note that he obtained the proof of completeness of first order logic readapting the argument found for the theory of types. It ...

متن کامل

Complete Cut-Free Tableaux for Equational Simple Type Theory

Church’s type theory [11] is a basic formulation of higher-order logic. Henkin [13] found a natural class of models for which Church’s Hilbert-style proof system turned out to be complete. Equality, originally expressed with higher-order quantification, was later identified as the primary primitive of the theory [14, 3, 1]. In this paper we consider simple type theory with primitive equality bu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2015